Genetic Algorithm based on a Pareto Neighborhood Search for Multiobjective Optimization
نویسندگان
چکیده
| In this paper, we examine the performance of a genetic algorithm based on a Pareto neighborhood search for multiobjective optimization. The purpose of the proposed method is to generate a set of non-dominated solutions that is properly distributed in the neighborhood of the trade-o surface. Simulation results show that the GA based on the proposed method has good performances better than the traditional GA approaches for several multiobjective owshop scheduling problems.
منابع مشابه
A Simple yet Efficient Multiobjective Combinatorial Optimization Method Using Decomposition and Pareto Local Search
Combining ideas from evolutionary algorithms, decomposition approaches and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: MoMad. It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MoMad evolves three populations: popula...
متن کاملHybrid multiobjective evolutionary algorithm based technique for economic emission load dispatch optimization problem
In this paper, we present a hybrid approach combining two optimization techniques for solving economic emission load dispatch (EELD) optimization problem. The proposed approach integrates the merits of both genetic algorithm (GA) and local search (LS), where it employs the concept of coevolution and repair algorithm for handling nonlinear constraints, also, it maintains a finite-sized archive o...
متن کاملVery Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems
Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is almost no study of VLSNS for multiobjective optimization. We show in this paper that this technique is very efficient for the resolution of multiobjective combinatorial optimization problems. Two problems are considered: the multiobjective multidimensional knapsack pr...
متن کاملAdaptive directional local search strategy for hybrid evolutionary multiobjective optimization
A novel adaptive local search method is developed for hybrid evolutionary multiobjective algorithms (EMOA) to improve convergence to the Pareto front in multiobjective optimization. The concepts of local and global effectiveness of a local search operator are suggested for dynamic adjustment of adaptation parameters. Local effectiveness is measured by quantitative comparison of improvements in ...
متن کاملXergy analysis and multiobjective optimization of a biomass gasification-based multigeneration system
Biomass gasification is the process of converting biomass into a combustible gas suitable for use in boilers, engines, and turbines to produce combined cooling, heat, and power. This paper presents a detailed model of a biomass gasification system and designs a multigeneration energy system that uses the biomass gasification process for generating combined cooling, heat, and electricity. Energy...
متن کامل